Parallel Processing Letters Fast Parallel Permutation Algorithms
نویسنده
چکیده
We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n/p)logn) and an improved algorithm with run time O(n/p+logn loglog(n/p)). Both algorithms require n additional global bits and O(1) local storage per processor. If preex summation is supported at the instruction level, the run time of the improved algorithm is O(n/p). The algorithms can be used to rehash the address space of a PRAM emulation.
منابع مشابه
Permutation Routing and Sorting on Meshes with Row and Column Buses
We study the problems of permutation routing and sorting on several models of meshes with xed and reconngurable row and column buses. We describe two fast and fairly simple deterministic algorithms for permutation routing on two-dimensional networks, and a more complicated algorithm for multi-dimensional networks. The algorithms are obtained by converting two known oo-line routing schemes into ...
متن کاملFast Parallel Permutation Algorithms
We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage We present a simple algorithm with run time O n p logn and an improved algorithm with run time O n p logn log log n p Both algorithms require n additional global bits and O local storage per processor If pre x summation is supported at the instruction level the run time of the ...
متن کاملImplementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملEfficient Parallel Algorithms for Template Matching
The parallel complexity of template matching has been well studied. In this paper we present more work-eÆcient algorithms than the existing ones. Our algorithms are based on FFT primitives. We consider the following models of computing: PRAM and the hypercube.
متن کاملAn Empirical Analysis of Parallel Random Permutation Algorithms ON SMPs
We compare parallel algorithms for random permutation generation on symmetric multiprocessors (SMPs). Algorithms considered are the sorting-based algorithm, Anderson’s shuffling algorithm, the dart-throwing algorithm, and Sanders’ algorithm. We investigate the impact of synchronization method, memory access pattern, cost of generating random numbers and other parameters on the performance of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995